(CLP) A programming framework based (like Prolog) on LUSH (or SLD) resolution, but in which unification has been replaced by a constraint solver. A CLP interpreter contains a Prolog-like inference engine and an {incremental constraint solver}. The engine sends constraints to the solver one at a time. If the new constraint is consistent with the collected constraints it will be added to the set. If it was inconsistent, it will cause the engine to backtrack. CLP* is a variant. ["Constraint Logic Programming", J. Jaffar et al, 14th POPL, ACM 1987]. (1994-11-01)

Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses.

Concurrent constraint logic programming is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a concurrent process is therefore programmed as the evaluation of a goal by the interpreter.

CLP(R) is a declarative programming language. It stands for constraint logic programming (Real) where real refers to the real numbers.

<language> Constraint Logic Programming (Real) A {constraint logic programming} language with real arithmetic constraints developed by Joxan Jaffar <joxan@watson.ibm.com> of IBM TJWRC and S. Michaylov of Monash University in 1986. The implementation contains a byte-code compiler and a built-in constraint solver which deals with {linear arithmetic} and contains a mechanism for delaying nonlinear constraints until they become linear. Since CLP(R) is a superset of PROLOG, the system is also usable as a general-purpose logic programming language. There are also powerful facilities for meta programming with constraints. Significant CLP(R) applications have been published in diverse areas such as molecular biology, finance and physical modelling. Version 1.2 for Unix, MS-DOS and OS/2 is available from the authors. It is free for academic and research purposes. E-mail: Roland Yap <roland@bruce.cs.monash.edu.au>. ["The CLP(R) Language and System", J. Jaffar et al, IBM RR RC16292 (#72336), Nov 1990]. (1992-10-14)

Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables.

The Journal of Logical and Algebraic Methods in Programming is a peer-reviewed scientific journal established in 1984. It was originally titled The Journal of Logic Programming; in 2001 it was renamed The Journal of Logic and Algebraic Programming, and in 2014 it obtained its current title.

In computational chemistry, a constraint algorithm is a method for satisfying the Newtonian motion of a rigid body which consists of mass points. A restraint algorithm is used to ensure that the distance between mass points is maintained.

<artificial intelligence, programming, language> A declarative, relational style of programming based on first-order logic. The original logic programming language was Prolog. The concept is based on Horn clauses. The programmer writes a "database" of "facts", e.g. wet(water). ("water is wet") and "rules", e.g. mortal(X) :- human(X). ("X is mortal is implied by X is human"). Facts and rules are collectively known as "clauses". The user supplies a "goal" which the system attempts to prove using "resolution" or "backward chaining". This involves matching the current goal against each fact or the left hand side of each rule using "unification". If the goal matches a fact, the goal succeeds; if it matches a rule then the process recurses, taking each sub-goal on the right hand side of the rule as the current goal. If all sub-goals succeed then the rule succeeds. Each time a possible clause is chosen, a "choice point" is created on a stack. If subsequent resolution fails then control eventually returns to the choice point and subsequent clauses are tried. This is known as "backtracking". Clauses may contain logic variables which take on any value necessary to make the fact or the left hand side of the rule match a goal. Unification binds these variables to the corresponding subterms of the goal. Such bindings are associated with the choice point at which the clause was chosen and are undone when backtracking reaches that choice point. The user is informed of the success or failure of his first goal and if it succeeds and contains variables he is told what values of those variables caused it to succeed. He can then ask for alternative solutions. (1997-07-14)

Logic programming is a programming paradigm which is largely based on formal logic. Any program written in a logic programming language is a set of sentences in logical form, expressing facts and rules about some problem domain.